A general mountain pass principle for locating and classifying critical points
نویسندگان
چکیده
منابع مشابه
The intrinsic mountain pass principle
{ In this note we present a general mountain pass principle dropping any smoothness or even continuity assumptions on the functional. As a corollary, we prove existence of a point with an arbitrarily xed small slope if the "low" part of the "barrier" is suuciently far from the "boundary", obtaining in addition estimates for the location of the point.
متن کاملLocating Cerami Sequences in a Mountain Pass Geometry
Let X be a real Banach space and Φ ∈ C 1 (X, R) a function with a mountain pass geometry. This ensures the existence of a Palais-Smale, and even a Cerami, sequence {u n } of approximate critical points for the mountain pass level. We obtain information about the location of such a sequence by estimating the distance of u n from S for certain types of set S as n → ∞. Under our hypotheses we can ...
متن کاملLevel set methods for finding critical points of mountain pass type
Computing mountain passes is a standard way of finding critical points. We describe a numerical method for finding critical points that is convergent in the nonsmooth case and locally superlinearly convergent in the smooth finite dimensional case. We apply these techniques to describe a strategy for addressing the Wilkinson problem of calculating the distance from a matrix to a closest matrix w...
متن کاملA Mountain Pass for Reacting Molecules
In this paper, we consider a neutral molecule that possesses two distinct stable positions for its nuclei, and look for a mountain pass point between the two minima in the non-relativistic Schrödinger framework. We first prove some properties concerning the spectrum and the eigenstates of a molecule that splits into pieces, a behaviour which is observed when the Palais-Smale sequences obtained ...
متن کاملLocating Critical Points in 3D Vector Fields using Graphics Hardware
Calculating critical points in 3D vector fields is computationally expensive, and requires parameter adjustments to maximize the number and type of critical points found in a particular 3D vector field. This paper details the modifications required to execute Greene’s bisection method directly on graphics hardware, and compares the performance of the CPU+GPU versions to the CPU only versions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincaré C, Analyse non linéaire
سال: 1989
ISSN: 0294-1449
DOI: 10.1016/s0294-1449(16)30313-4